Higher order semidefinite relaxations for quadratic programming - Decision and Control, 2000. Proceedings of the 39th IEEE Conference on
نویسنده
چکیده
In this paper, we present improved versions of the standard semidefinite relaxation for quadratic programming, that underlies many important results in robustness analysis and combinatorial optimization. It is shown that the proposed polynomial time convex conditions are at least as strong as the standard ones, and usually better, but at a higher computational cost. Several applications of the new relaxations are provided, including less conservative upper bounds for the structured singular value p and enhanced solutions for the MAX CUT graph partitioning problem.
منابع مشابه
Semidefinite programming based tests for matrix copositivity - Decision and Control, 2000. Proceedings of the 39th IEEE Conference on
The verification of matrix copositivity is a well known computationally hard problem, with many applications in continuous and combinatorial optimization. In this paper, we present a hierarchy of semidefinite programming based sufficient conditions for a real matrix to be copositive. These conditions are obtained through the use of a sum of squares decomposition for multivariable forms. As can ...
متن کاملSecond-Order Cone Relaxations for Binary Quadratic Polynomial Programs
Several types of relaxations for binary quadratic polynomial programs can be obtained using linear, secondorder cone, or semidefinite techniques. In this paper, we propose a general framework to construct conic relaxations for binary quadratic polynomial programs based on polynomial programming. Using our framework, we re-derive previous relaxation schemes and provide new ones. In particular, w...
متن کاملOn Semidefinite Programming Relaxations of the Traveling Salesman Problem
We consider a new semidefinite programming (SDP) relaxation of the symmetric traveling salesman problem (TSP), that may be obtained via an SDP relaxation of the more general quadratic assignment problem (QAP). We show that the new relaxation dominates the one in the paper: [D. Cvetković, M. Cangalović and V. Kovačević-Vujčić. Semidefinite Programming Methods for the Symmetric Traveling Salesman...
متن کاملErratum: On Semidefinite Programming Relaxations of the Traveling Salesman Problem
We consider a new semidefinite programming (SDP) relaxation of the symmetric traveling salesman problem (TSP), that may be obtained via an SDP relaxation of the more general quadratic assignment problem (QAP). We show that the new relaxation dominates the one in the paper: [D. Cvetković, M. Cangalović and V. Kovačević-Vujčić. Semidefinite Programming Methods for the Symmetric Traveling Salesman...
متن کاملConvergent LMI relaxations for nonconvex quadratic programs
We consider the general nonconvex quadratic programming problem and provide a series of convex positive semidefinite programs (or LMI relaxations) whose sequence of optimal values is monotone and converges to the optimal value of the original problem. It improves and includes as a special case the well-known Shor’s LMI formulation. Often, the optimal value is obtained at some particular early r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000